Evaluating Resistance to False-Name Manipulations in Elections
نویسندگان
چکیده
In many mechanisms (especially online mechanisms), a strategic agent can influence the outcome by creating multiple false identities. We consider voting settings where the mechanism designer cannot completely prevent false-name manipulation, but may use false-name-limiting methods such as CAPTCHAs to influence the amount and characteristics of such manipulation. Such a designer would prefer, first, a high probability of obtaining the “correct” outcome, and second, a statistical method for evaluating the correctness of the outcome. In this paper, we focus on settings with two alternatives. We model voters as independently drawing a number of identities from a distribution that may be influenced by the choice of the false-name-limiting method. We give a criterion for the evaluation and comparison of these distributions. Then, given the results of an election in which false-name manipulation may have occurred, we propose and justify a statistical test for evaluating the outcome.
منابع مشابه
Using Mechanism Design to Prevent False-Name Manipulations
When mechanisms such as auctions, rating systems, and elections are run in a highly anonymous environment such as the Internet, a key concern is that a single agent can participate multiple times by using false identifiers. Such false-name manipulations have traditionally not been considered in the theory of mechanism design. In this article, we review recent efforts to extend the theory to add...
متن کاملFalse Name Manipulations in Weighted Voting Games: Susceptibility of Power Indices
The splitting of weights into smaller sizes by agents in a weighted voting game and the distribution of the new weights among several false identities with the intent of payoff or power increase in a new game consisting of the original agents as well as the false identities is called false name manipulation. In this paper, we study false name manipulations in weighted voting games focusing on t...
متن کاملFairness and False-Name Manipulations in Randomized Cake Cutting
Cake cutting has been recognized as a fundamental model in fair division, and several envy-free cake cutting algorithms have been proposed. Recent works from the computer science field proposed novelmechanisms for cake cutting, whose approaches are based on the theory of mechanism design; these mechanisms are strategy-proof, i.e., no agent has any incentive to misrepresent her utility function,...
متن کاملCharacterization of false-name-proof social choice mechanisms
Mechanism Design has been developed as a significant tool to model and analyze markets, economies, and societies in the real-world. On the Internet, however, we face some unexpected problems such as false-name manipulations, and traditional mechanism design does not work sufficiently. In this thesis, we will developmechanism design into amore applicable theory for computer sciences and economic...
متن کاملNew Bounds on False-Name Manipulations in Weighted Voting Games
We consider false-name manipulation in weighted voting games (WVGs). False-name manipulation involves an agent, termed a manipulator, splitting its weight among several false identities in anticipation of power increase. False-name manipulation has been identified as a problem in WVGs. Indeed, in open anonymous environments, this manipulation can be easy and cheap to achieve. Previous works hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012